23 research outputs found

    Mobile-Based Video Caching Architecture Based on Billboard Manager

    Full text link
    Video streaming services are very popular today. Increasingly, users can now access multimedia applications and video playback wirelessly on their mobile devices. However, a significant challenge remains in ensuring smooth and uninterrupted transmission of almost any size of video file over a 3G network, and as quickly as possible in order to optimize bandwidth consumption. In this paper, we propose to position our Billboard Manager to provide an optimal transmission rate to enable smooth video playback to a mobile device user connected to a 3G network. Our work focuses on serving user requests by mobile operators from cached resource managed by Billboard Manager, and transmitting the video files from this pool. The aim is to reduce the load placed on bandwidth resources of a mobile operator by routing away as much user requests away from the internet for having to search a video and, subsequently, if located, have it transferred back to the user.Comment: 8 pages, 1 figure, GridCom-201

    A Tool Based Edge Server Selection Technique using Spatial Data Structure

    Get PDF
    Space partitioning is the process of dividing a Euclidean space into a non-overlapping regions. Kdimensional tree is such space-partitioning data structure for partitioning a Euclidean plane like the surface of earth. This paper describes a tool-based logically partitioning technique of earth surface using K-dimensional tree to segregate the edge servers over the earth surface into a nonoverlapping regions for the particular Content Delivery Network. Consequently selecting an edge server based on Least Response Time lo ad balancing algorithm is introduced to improve end-user response time and fault tolerance of the host server

    An Efficient Edge Servers Selection in Content Delivery Network Using Voronoi Diagram

    Get PDF
    Handle on demand network popularity of the Content Delivery Network and solve the flash crowd problem, caching web content at the internet’s edge server has been emerged. To provide faster service of the web users, content come from nearby edge servers. Therefore nearest edge server finding of a particular web user is an open research problem and it ensures a faster response time and download time of the requested content due to reduced latency. Our simulation study and application to a real set of geographical coordinates of the edge servers which are geographically dispersed and a well-known geometric device, Voronoi diagram is used for decomposing the earth surface around each location of a particular edge server and closest edge servers of the requested web user is searched by the nearest neighbor queries using Delaunay triangulation property over the aforesaid decomposed earth surface

    Minimization of Handoff Failure Probability for Next-Generation Wireless Systems

    Full text link
    During the past few years, advances in mobile communication theory have enabled the development and deployment of different wireless technologies, complementary to each other. Hence, their integration can realize a unified wireless system that has the best features of the individual networks. Next-Generation Wireless Systems (NGWS) integrate different wireless systems, each of which is optimized for some specific services and coverage area to provide ubiquitous communications to the mobile users. In this paper, we propose to enhance the handoff performance of mobile IP in wireless IP networks by reducing the false handoff probability in the NGWS handoff management protocol. Based on the information of false handoff probability, we analyze its effect on mobile speed and handoff signaling delay.Comment: 16 Page
    corecore